Rational stochastic automata in formal language theory
نویسندگان
چکیده
منابع مشابه
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are “compatible”. Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to apply the defining diagrams of algebras, coalgebras, and bialgebras to categories of semimodules and semimodule homomorphisms over a commutative semiring. We ...
متن کاملTowards a Formal Language Theory of Stochastic Grammars
This table shows that a model which defines probabilities over parse trees by taking into account only one derivation, does not accommodate the frequencies of all subtrees that may contribute to the generation of a parse tree. By taking into account the probabilities of all derivations of a parse tree, no subtree that might possibly be of statistical interest is ignored. How can we compute the ...
متن کاملLanguage modeling with stochastic automata
It is well known that language models are effective for increasing accuracy of speech and handwriting recognizers, but large language models are often required to achieve low model perplexity (or entropy) and still have adequate language coverage. We study three efficient methods for stochastic language modeling in the context of the stochastic pattern recognition problem and give results of a ...
متن کاملStochastic automata for language modeling
Stochastic language models are widely used in spoken language understanding to recognize and interpret the speech signal: the speech samples are decoded into word transcriptions by means of acoustic and syntactic models and then interpreted according to a semantic model. Both for speech recognition and understanding, search algorithms use stochastic models to extract the most likely uttered sen...
متن کامل1 Formal Language Theory
This chapter provides a gentle introduction to formal language theory, aimed at readers with little background in formal systems. The motivation is natural language processing (NLP), and the presentation is geared towards NLP applications, with linguistically motivated examples, but without compromising mathematical rigor. The text covers elementary formal language theory, including: regular la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1982
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-7-1-31-44